

#include<iostream>
#include<vector>
using namespace std;

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int n = nums.size();

        int left = 0, right = n - 1;
        while (left <= right)
        {
            int mid = left + (right - left) / 2;
            if (nums[mid] == target) {
                return mid;
            }
            else if (nums[mid] < target) {
                left = mid + 1;
            }
            else {
                right = mid - 1;
            }
        }
        return left;
    }
};

//int main()
//{
//    vector<int> nums = { };
//
//    Solution s;
//    int a = s.searchInsert(nums, 1);
//    cout << a << endl;
//    //cout << a[1] << endl;
//    //int a = s.search(nums, 9);
//	return 0;
//}